Improvements in Parallel Job Scheduling Using Gang Service
نویسندگان
چکیده
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a class of scheduling policies, dubbed Concurrent Gang, that is a generalization of gang-scheduling, and allows for the flexible simultaneous scheduling of multiple parallel jobs, thus improving the space sharing characteristics of gang scheduling. However, all the advantages of gang scheduling such as responsiveness, efficient sharing of resources, ease of programming, etc., are maintained.
منابع مشابه
A Mes Parents
Parallel job scheduling is an important problem whose solution may lead to better utilization of modern parallel computers. It is de ned as : Given the aggregate of all tasks of multiple jobs in a parallel system, nd a spatial and temporal allocation to execute all tasks e ciently . For the purposes of scheduling, we view a computer as a queueing system. An arriving job may wait for some time, ...
متن کاملImproving Parallel Job Scheduling Using Runtime Measurements
We investigate the use of runtime measurements to improve job scheduling on a parallel machine. Emphasis is on gang scheduling based strategies. With the information gathered at runtime, we deene a task classiication scheme based on fuzzy logic and Bayesian estimators. The resulting local task classiication is used to provide better service to I/O bound and interactive jobs under gang schedulin...
متن کاملSimulation-Based Average Case Analysis for Parallel Job Scheduling
This paper analyses the resource allocation problem in parallel jobs scheduling, with emphasis given to gang service algorithms. Gang service has been widely used as a practical solution to the dynamic parallel job scheduling problem. To provide a sound analysis of gang service performance, a novel methodology based on the traditional concept of competitive ratio is introduced. Dubbed dynamic c...
متن کاملScheduling Gangs in a Distributed System
In this paper we study the performance of parallel job scheduling in a distributed system. A special type of scheduling called gang scheduling is considered. In gang scheduling jobs consist of a number of interacting tasks, which are scheduled to run simultaneously on distinct processors. Two gang scheduling policies are used to schedule parallel jobs for two different types of job parallelism....
متن کاملTrace-driven Analysis of Migration-based Gang Scheduling Policies for Parallel Computers
Gang scheduling is a job scheduling policy for parallel computers that combines elements of space-sharing and time-sharing. In this paper, we analyze the performance of gang scheduling policies that allow the remapping of an executing job to a new set of processors. Most previously proposed gang-scheduling policies do not allow such job remapping under the assumption that it is prohibitively ex...
متن کامل